Hybrid consensus for multi-agent systems with time-driven jumps

In this paper, the behavior of scalar multi-agent systems over networks subject to time-driven jumps. Assuming that all agents communicate through distinct communication digraphs at jump and flow times, asymptotic multi-consensus hybrid network is explicitly characterized. The shown be associated with a suitable partition almost equitable for both digraphs. doing so, no assumption on underlying introduced. Finally, coupling rules making subspace attractive are established. Several simulation examples illustrate theoretical results.